/*
 * @lc app=leetcode.cn id=1980 lang=cpp
 *
 * [1980] 找出不同的二进制字符串
 */

// @lc code=start
class Solution
{
public:
    string findDifferentBinaryString(vector<string> &nums)
    {
        int n = nums.size();
        string ans;
        for (int i = 0; i < n; i++)
        {
            ans += nums[i][i] == '0' ? '1' : '0';
        }
        return ans;
    }
};
// @lc code=end
